Middlemen and Contestation in Directed Networks
نویسندگان
چکیده
This paper studies middlemen—or “critical nodes”—that intermediate flows in a directed network. The contestability of a node is introduced as a network topological concept of competitiveness meaning that an intermediary’s role in the brokering of flows in the network can be substituted by a group of other nodes. We establish the equivalence of uncontested intermediaries and middlemen. The notion of node contestability gives rise to a measure that quantifies the control exercised by a middleman in a network. We present a comparison of this middleman centrality measures with relevant, established network centrality measures. Furthermore, we provide concepts and measures expressing the robustness of a middleman as the number of links or nodes that have to be added to or removed from the network to nullify the middleman’s power. We use these concepts to identify and measure middleman power and robustness in two empirical networks: Krackhardt’s advice network of managers in a large corporation and the well-known Florentine marriage network as a proxy of power brokerage between houses in Renaissance Florence.
منابع مشابه
Critical Nodes In Directed Networks
Critical nodes—or “middlemen”—have an essential place in both social and economic networks when considering the flow of information and trade. This paper extends the concept of critical nodes to directed networks. We identify strong and weak middlemen. Node contestability is introduced as a form of competition in networks; a duality between uncontested intermediaries and middlemen is establishe...
متن کاملMiddlemen in Peer-to-Peer Networks: Stability and Efficiency∗
A fundamental tension of between the efficiency and stability of social networks is now a well recognized fact in the literature. In general, networks are not simultaneously efficient and stable. Here we consider strongly pairwise stable networks and identify that the presence of middlemen is of particular importance for such a network to be efficient as well. We find that for the component wis...
متن کاملRegion Directed Diffusion in Sensor Network Using Learning Automata:RDDLA
One of the main challenges in wireless sensor network is energy problem and life cycle of nodes in networks. Several methods can be used for increasing life cycle of nodes. One of these methods is load balancing in nodes while transmitting data from source to destination. Directed diffusion algorithm is one of declared methods in wireless sensor networks which is data-oriented algorithm. Direct...
متن کاملRegion Directed Diffusion in Sensor Network Using Learning Automata:RDDLA
One of the main challenges in wireless sensor network is energy problem and life cycle of nodes in networks. Several methods can be used for increasing life cycle of nodes. One of these methods is load balancing in nodes while transmitting data from source to destination. Directed diffusion algorithm is one of declared methods in wireless sensor networks which is data-oriented algorithm. Direct...
متن کاملArrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1612.08884 شماره
صفحات -
تاریخ انتشار 2016